package 力扣._104_二叉树最大深度;
import 力扣.公用数据结构.TreeNode;

public class Solution {

    public int maxDepth(TreeNode root) {
        if (root == null)
            return 0;
        return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
    }
}
